Some Results on Petri Net Languages
نویسنده
چکیده
We compare various classes of Petri net languages. We present a new constructive proof of the equivalence, from the point of view of descriptive power, of “general” Petri nets and “restricted” Petri nets (no multiple arcs nor self-loops are allowed in the latter class). We also comment on the descriptive power of Petri nets versus that of finitely recursive processes.
منابع مشابه
Logical Characterization of Petri Net !-languages
In this paper, we study some classes of Petri net deenable !-languages. We consider several types of accepting conditions on Petri nets, corresponding to those considered on nite automata in the theory of !-regular languages. Then, we establish a neat correspondence between the classes of Petri net deenable !-languages and the classes of nite automata deenable !-languages. Moreover, each class ...
متن کاملA Petri-net based modeling tool, for analysis and evaluation of computer systems
Petri net is one of the most popular methods in modeling and evaluation of concurrent and event-based systems. Different tools have been created to support modeling and simulation of different extensions of Petri net in different applications. Each tool supports some extensions and some features. In this work a Petri net based modeling and evaluation tool is presented that not only supports dif...
متن کاملPetri Net Languages and Infinite Subsets of
Families of Petri net languages are usually defined by varying the type of transition labeling and the class of subsets of N to be used as sets of final markings (m is the number of places). So far three main classes of subsets have been studied: the trivial class containing as single element N, the class of finite subsets of N, and the class of ideals (or covering subsets) of N. In this paper ...
متن کاملPetri Net Languages and Innnite Subsets of N M Proposed Running Head
Families of Petri net languages are usually de ned by varying the type of transition labeling and the class of subsets of Nm to be used as sets of nal markings (m is the number of places). So far three main classes of subsets have been studied: the trivial class containing as single element Nm , the class of nite subsets of Nm , and the class of ideals (or covering subsets) of Nm . In this pape...
متن کاملTime Management Approach on a Discrete Event Manufacturing System Modeled by Petri Net
Discrete event system, Supervisory control, Petri Net, Constraint This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004